Action Planning for Graph Transition Systems
نویسندگان
چکیده
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution. State spaces of such systems can be represented by graph transition systems, which are basically transition systems whose states and transitions represent graphs and graph morphisms. In this paper, we propose the modeling of graph transition systems in PDDL and the application of heuristic search planning for their analysis. We consider different heuristics and present experimental results.
منابع مشابه
A Game Theoretic Approach for Sustainable Power Systems Planning in Transition
Intensified industrialization in developing countries has recently resulted in huge electric power demand growth; however, electricity generation in these countries is still heavily reliant on inefficient and traditional non-renewable technologies. In this paper, we develop an integrated game-theoretic model for effective power systems planning thorough balancing between supply and demand for e...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملGenerating Parallel Plans Based on Planning Graph Analysis of Predicate/Transition Nets
Multi-agent systems often exhibit rich parallelism among agents. It is desirable in a multi-agent planner to explicitly represent parallel actions. This paper presents an approach for generating parallel execution plans based on the planning graph analysis. Instead of representing a planning problem by STRIPS operators, we model multi-agent planning domains using Predicate/Transition (PrT) nets...
متن کاملThe Graph Transformation Benchmark for the International Knowledge Engineering Competition for Planning & Scheduling
This document provides the material necessary to deal with the graph transformation benchmarks, as featured in the International Competition on Knowledge Engineering for Planning & Scheduling (ICKEPS-07). We propose Groove as a simulator to study different test models. Graph transition systems are suitable representations for software and hardware systems and extend traditional transition syste...
متن کاملAction Planning for Directed Model Checking of Petri Nets
Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems. Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the set of reachable markings. Typical exploration(reachability analysis) approaches are undirected and do not take into account any knowledge about the structure...
متن کامل